MONTY: an algorithm for predicting growth rates for any crystal structure in any orientation
نویسندگان
چکیده
منابع مشابه
An Algorithm for Any { Time SpeechUnderstanding
This paper presents a parallel control algorithm for pattern understanding using a sematic network formalism for knowledge representation. Anytime capabilities, which are important for real world applications, are achieved by the use of iterative optimization techniques, like e.g. genetic algorithms, and the parallel processing of knowledge. First results from an application of the algorithm in...
متن کاملBetter Rates for Any Adversarial Deterministic MDP
We consider regret minimization in adversarial deterministic Markov Decision Processes (ADMDPs) with bandit feedback. We devise a new algorithm that pushes the state-of-theart forward in two ways: First, it attains a regret of O(T ) with respect to the best fixed policy in hindsight, whereas the previous best regret bound was O(T ). Second, the algorithm and its analysis are compatible with any...
متن کاملAn algorithm for computing CVTs for any Cantor distribution
Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions with respect to a given probability measure. CVT is a fundamental notion that has a wide spectrum of applications in computational science and engineering. In this paper, an algorithm is given to obtain the...
متن کاملAn efficient finite difference time domain algorithm for band structure calculations of Phononic crystal
In this paper, a new algorithm for studying elastic wave propagation in the phononic crystals is presented. At first, the displacement-based forms of elastic wave equations are derived and then the forms are discretized using finite difference method. So the new algorithm is called the displacement-based finite difference time domain (DBFDTD). Three numerical examples are computed with this met...
متن کاملThat Perfect Algorithm for Any Occasion
A lgorithms—can’t live without ’em; can’t find ’em. Or, at any rate, can’t find that one you want when you have a problem in mind and suspect that someone else long-ago published a solution. Here, then, are two books with very different approaches to this algorithm recall problem. Encyclopedia of Algorithms is a massive book, organized alphabetically into some 400 entries, each two to three pag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section A Foundations of Crystallography
سال: 2005
ISSN: 0108-7673
DOI: 10.1107/s0108767305081304